A Linear Time Algorithm for the Hitchcock Transportation Problem with Fixed Number of Supply Points
نویسنده
چکیده
In this paper, we propose an O(n) time algorithm for the Hitchcock transportation problem with n demand points and xed number of supply points. When the number of supply points is very small and the number of demand points is much larger than that of supply points, our algorithm is e cient. If we have m supply points, the time complexity of our algorithm is bounded by O((m!) 2 n) .
منابع مشابه
Designing an integrated production/distribution and inventory planning model of fixed-life perishable products
This paper aims to investigate the integrated production/distribution and inventory planning for perishable products with fixed life time in the constant condition of storage throughout a two-echelon supply chain by integrating producers and distributors. This problem arises from real environment in which multi-plant with multi-function lines produce multi-perishable products with fixed life ti...
متن کاملMeta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملPolynomial Time Interior Point Algorithms for Transportation Problems
This paper deals with the Hitchcock transportation problem with m supply points and n demand points. Assume that m ~ n and all the data are positive integers which are less than or equal to an integer M. We propose two polynomial time algorithms for solving the problems. The algorithms are based on the interior point algorithms for solving general linear programming problems. Using some feature...
متن کاملA Genetic Algorithm Developed for a Supply Chain Scheduling Problem
This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...
متن کاملFully Fuzzy Transportation Problem
Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993